Empirical Optimality of Coverage Design Criteria for Space-Filling Designs

Sliced space - filling designs

We propose an approach to constructing a new type of design, a sliced space-filling design, intended for computer experiments with qualitative and quantitative factors. The approach starts with constructing a Latin hypercube design based on a special orthogonal array for the quantitative factors and then partitions the design into groups corresponding to different level combinations of the qual...

Sudoku - based space - filling designs

Sudoku is played by millions of people across the globe. It has simple rules and is very addictive. The game board is a nine-by-nine grid of numbers from one to nine. Several entries within the grid are provided and the remaining entries must be filled in subject to no row, column, or three-by-three subsquare containing duplicate numbers. By exploiting these three types of uniformity, we propos...

Optimality Criteria for Design of Crossbreeding Experiments

Since the influential work of Dickerson (1969), there has been considerable discussion of design of crossbreeding experiments, but little detailed treatment of optimisation. Recently, Cunningham and Connolly (1989) and Soelkner and James (1990) have discussed this question, but have used different optimality criteria. Connolly and Cunningham used the sum of sampling variances of estimators, whi...

Construction of Nested Space - Filling Designs

New types of designs called nested space-filling designs have been proposed for conducting multiple computer experiments with different levels of accuracy. In this article, we develop several approaches to constructing such designs. The development of these methods also leads to the introduction of several new discrete mathematics concepts, including nested orthogonal arrays and nested differen...

On the Choice of Optimality Criteria in Comparing Statistical Designs